2-vertex connectivity in directed graphs
نویسندگان
چکیده
منابع مشابه
2-Vertex Connectivity in Directed Graphs
We complement our study of 2-connectivity in directed graphs [7], by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally vertex-disjoint paths from v to w and two internally vertex-disjoint paths from w to v. We also say that v and w are vertex-resilient if the removal of any vertex dif...
متن کامل2-Connectivity in Directed Graphs
We survey some recent results on 2-edge and 2-vertex connectivity problems in directed graphs. Despite being complete analogs of the corresponding notions on undirected graphs, in digraphs 2vertex and 2-edge connectivity have a much richer and more complicated structure. It is thus not surprising that 2-connectivity problems on directed graphs appear to be more difficult than on undirected grap...
متن کاملIncremental 2-Edge-Connectivity in Directed Graphs
We present an algorithm that can update the 2-edge-connected blocks of a directed graph with n vertices through a sequence of m edge insertions in a total of O(mn) time. After each insertion, we can answer the following queries in asymptotically optimal time: Test in constant time if two query vertices v and w are 2-edge-connected. Moreover, if v and w are not 2-edge-connected, we can produce i...
متن کاملIncremental Strong Connectivity and 2-Connectivity in Directed Graphs
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of those cuts. We give a conditional lower bound that provides evidence that our algorithms may be tight up to a sub-polynomial factors. As an additional resul...
متن کاملOn 2-Approximation to the Vertex-Connectivity in Graphs
Given a graph G, we give a fast algorithm for approximating the vertex connectivity κ of G. Our algorithm delivers a minimum vertex cut of G if κ <= δ/2 , and returns a message “κ > δ/2 ” otherwise, where δ denotes the minimum degree of G. The algorithm runs in O(n2(1+min{κ2, κ√n}/δ)) time and O(n+m) space, where n and m denote the numbers of vertices and edges in G, respectively. key words: gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2018
ISSN: 0890-5401
DOI: 10.1016/j.ic.2018.02.007